Speeding Lamport's Fast Mutual Exclusion Algorithm
نویسندگان
چکیده
A linked list is used to speed up a mutual exclusion algorithm. This optimization permits additional concurrency by allowing scans of the list to be concurrent with insertions and deletions of list entries.
منابع مشابه
Fast Mutual Exclusion, Even With Contention
We present a mutual exclusion algorithm that performs well both with and without contention, on machines with no atomic instructions other than read and write. The algorithm capitalizes on the ability of memory systems to read and write at both fulland half-word granularities. It depends on predictable processor execution rates, but requires no bound on the length of critical sections, performs...
متن کاملComputer Aided Verification of Lamport's Fast Mutual Exclusion Algorithm Using Colored Petri Nets and Occurrence Graphs with Symmetries
In this paper, we present a new computer tool for veriication of distributed systems. As an example, we establish the correctness of Lamport's Fast Mutual Exclusion Algorithm. The tool implements the method of occurrence graphs with symmetries (OS-graphs) for Coloured Petri Nets (CP-nets). The basic idea in the approach is to exploit the symmetries inherent in many distributed systems to constr...
متن کاملA New Approach to Proving the Correctness of Multiprocess
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new algorithm to solve the mutual exclusion problem. The algorithm is an improved version of the bakery algorithm. It is specified and proved correct without being decomposed into indivisible, atomic operations. This allows two different implementations for a conventional, non...
متن کاملCausality for Time: How to Specify and Verify Distributed Algorithms
We illustrate a technique for proving properties of distributed programs. Our technique avoids the notion of global time or global state. Furthermore, it does not require any use of temporal logic. All properties are proven using induction on the happened-before relation and its complement. We illustrate our technique by providing a formal proof of Lamport's algorithm for mutual exclusion.
متن کاملParameterized Verification of Infinite-State Processes with Global Conditions
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The individual processes operate on unbounded local variables ranging over the natural numbers. In addition, processes may communicate via broadcast, rendez-vous and shared variables. We apply the algorithm to verify mutual exc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 45 شماره
صفحات -
تاریخ انتشار 1993